Eulerian pairs and Eulerian recurrence systems
نویسندگان
چکیده
In this paper, we introduce the definitions of Eulerian pair and Hermite-Biehler pair. We also characterize a duality relation between recurrences recurrence systems. This generalizes unifies decompositions several enumerative polynomials, including up-down run polynomials for symmetric groups, alternating hyperoctahedral flag descent groups ascent-plateau Stirling permutations. derive some properties associated polynomials. particular, prove alternatingly increasing property interlacing left
منابع مشابه
Eulerian polynomials
A short report on my lecture at the Conference in Honor of W. Killing in Münster on December 7, 2007, together with some remarks on the preceding paper by ArjehM. Cohen. I reported on Euler’s famous paper Remarques sur un beau rapport entre les series des puissances tant direct que reciproques, Académie des sciences de Berlin, Lu en 1749, Opera Omnia Serie I, Bd. 15, pp. 70-90. In modern termin...
متن کاملEulerian Trilogy
Three Eulerian models are implemented on a network graph model of air traffic flow. The underlying network is constructed using one year of ASDI/ETMS data. The three models are applied to high altitude traffic for a full Air Route Traffic Control Center of the National Airspace System and surrounding airspace. Simulations are carried out for a full day of data, to assess the predictive capabili...
متن کاملIndex-Free Multiagent Systems: An Eulerian Approach ?
Since the properties of systems comprising many homogeneous agents may be expected to be independent of how the agents happen to be indexed, it should be possible to formulate and solve multiagent control problems in an index-free way. In this paper we provide such an approach, based on an indicator distribution representation, which results in integrodifferential dynamics that parallel and ext...
متن کاملDerivatives and Eulerian Numbers
The aim of the present note is to give a closed form formula for the nth derivative of a function which satisfies Riccati’s differential equation with constant coefficients. The paper is organized as follows. In section 2 we recall the definition and basic properties of Eulerian numbers. We introduce and prove the mentioned formula in section 3. Some examples where the formula can be applied ar...
متن کاملTraversing Directed Eulerian Mazes
The paper describes two algorithms for threading unknown, finite directed Eulerian mazes. Each of these algorithms is performed by a traveling robot whose control is a finite-state automaton. It is assumed that each vertex has a circular list of its outgoing edges. The items of this list are called exits. Each of the algorithms puts in one of the exits of each vertex a scan pebble. These pebble...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2022
ISSN: ['1872-681X', '0012-365X']
DOI: https://doi.org/10.1016/j.disc.2021.112716